Not-Sampled Issue and Round-Replacement Tournament Selection

Sampling Issues of Tournament Selection in Genetic Programming

Tournament selection is one of the most commonly used parent selection schemes in Genetic Programming (GP). While it has a number of advantages over other selection schemes, it still has some issues that need to be thoroughly investigated. Two of the issues are assocated with the sampling process from the population into the tournament. The first one is the socalled “multi-sampled” issue, where...

Efficient Simulation of a Random Knockout Tournament

We consider the problem of using simulation to efficiently estimate the win probabilities for participants in a general random knockout tournament. Both of our proposed estimators, one based on the notion of “observed survivals” and the other based on conditional expectation and post-stratification, are highly effective in terms of variance reduction when compared to the raw simulation estimato...

Modeling Tournament Selection With Replacement Using Apparent Added Noise

Kwang-Ju Institute of Science and Technology

An augmented compact genetic algorithm (acGA) is presented in this paper. It exhibits all the desirable characteristics of compact genetic algorithm (cGA). While the selection strategy of cGA is similar to (steady-state) tournament selection with replacement (TSR), the proposed algorithm employs a strategy akin to tournament selection without replacement (TS/R). The latter is a common feature o...

Real-Parameter Genetic Algorithms for Finding Multiple Optimal Solutions in Multi-modal Optimization

The aim of this paper is to identify Genetic Algorithms (GAs) which perform well over a range of continuous and smooth multimodal real-variable functions. In our study, we focus on testing GAs combining three classes of genetic operators: selection, crossover and replacement. The approach followed is time-constrained and thus our stopping criterion is a fixed number of generations. Results show...